A Priori Laplacian with Hamming Distance: Advanced Dimension Reduction Technique

نویسنده

  • Gaurav Gupta
چکیده

Images containing faces are essential to intelligent visionbased human computer interaction, and research efforts in face processing include face recognition, face tracking, pose estimation, and expression recognition. The rapidly expanding research in face processing is based on the premise that information about a user’s identity, state, and intent can be extracted from images and that computers can then react accordingly, e.g., by knowing person’s identity, person may be authenticated to utilize a particular service or not. A first step of any face processing system is registering the locations in images where faces are present. However, face registration for whole database is a challenging task because of variability in scale, location, orientation (up-right, rotated), and pose (frontal, profile). Facial expression, occlusion, and lighting conditions also change the overall appearance of face. The Image registration algorithm will register all these images present in the database. The face recognition algorithm which is insensitive to large variation in lighting direction and facial expression is to be implemented. Taking a pattern classification approach, each pixel in an image can be considered as a coordinate in a high-dimensional space. The advantage of this is that the images of a particular face, under varying illumination but fixed pose, lie in a 3D linear subspace of the high dimensional image space—if the face is a Lambertian surface. However, since faces are not truly Lambertian surfaces and do indeed produce self-shadowing images will deviate from this linear subspace. Rather than explicitly modeling this deviation, project the image into a subspace in such a manner which discounts those regions of the face with large deviation. This is achieved by using dimension reduction techniques like Principal component analysis (PCA), Linear Discriminant analysis (LDA), Laplacian faces and other modified approaches like A Priori Laplacian and A Priori Laplacian with Hamming Distance. General Terms Face Recognition, Image Processing, Pattern Recognition

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

Laplacian Co-hashing of Terms and Documents

A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are mapped to similar codes within a short Hamming distance. In this paper, we introduce the novel problem of co-hashing where both documents and terms are hashed simultaneously according to their semantic similarities. Fur...

متن کامل

Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

متن کامل

Efficient Decoding of Ternary Error-Correcting Output Codes for Multiclass Classification

We present an adaptive decoding algorithm for ternary ECOC matrices which reduces the number of needed classifier evaluations for multiclass classification. The resulting predictions are guaranteed to be equivalent with the original decoding strategy except for ambiguous final predictions. The technique works for Hamming Decoding and several commonly used alternative decoding strategies. We sho...

متن کامل

The One-Way Communication Complexity of Hamming Distance

Consider the following version of the Hamming distance problem for ±1 vectors of length n: the promise is that the distance is either at least 2 + √ n or at most 2 − √ n, and the goal is to find out which of these two cases occurs. Woodruff (Proc. ACM-SIAM Symposium on Discrete Algorithms, 2004) gave a linear lower bound for the randomized one-way communication complexity of this problem. In th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013